The predicates of the Apollonius diagram: Algorithmic analysis and implementation
نویسندگان
چکیده
We study the predicates involved in an efficient dynamic algorithm for computing the Apollonius diagram in the plane, also known as the additively weighted Voronoi diagram. We present a complete algorithmic analysis of these predicates, some of which are reduced to simpler and more easily computed primitives. This gives rise to an exact and efficient implementation of the algorithm, that handles all special cases. Among our tools we distinguish an inversion transformation and an infinitesimal perturbation for handling degeneracies. The implementation of the predicates requires certain algebraic operations. In studying the latter, we minimize the algebraic degree of the predicates, thus optimizing the required precision to perform exact arithmetic. We also try to minimize the number of arithmetic operations; this twofold optimization corresponds to reducing bit complexity. The proposed algorithms are based on static Sturm sequences of univariate polynomials and make use of geometric invariants to simplify calculations. Multivariate resultants provide a deeper understanding of the predicates and are compared against our methods. We expect that our algebraic techniques are sufficiently powerful and general to be applied to a number of analogous geometric problems on curved objects. Their efficiency, and that of the overall implementation, are illustrated by a series of numerical experiments. Our approach can be immediately extended to the incremental construction of abstract Voronoi diagrams for various classes of objects.
منابع مشابه
A cgal-based implementation for the Voronoi diagram of ellipses
We present a C++ open-source implementation of an incremental algorithm for the computation of the Voronoi diagram of ellipses in the Euclidean plane. This is the first complete implementation, under the exact computation paradigm, for the given problem. It is based on the cgal package for the Apollonius diagram in the plane: exploiting the generic programming principle, our main additions conc...
متن کاملDifferential Power Analysis: A Serious Threat to FPGA Security
Differential Power Analysis (DPA) implies measuring the supply current of a cipher-circuit in an attempt to uncover part of a cipher key. Cryptographic security gets compromised if the current waveforms obtained correlate with those from a hypothetical power model of the circuit. As FPGAs are becoming integral parts of embedded systems and increasingly popular for cryptographic applications and...
متن کاملApollonius Solutions in Rd
Voronoi and related diagrams have technological applications, for example, in motion planning and surface reconstruction, and also find significant use in materials science, molecular biology, and crystallography. Apollonius diagrams arguably provide the most natural division of space for many materials and technology problems, but compared to Voronoi and power diagrams, their use has been limi...
متن کاملACS Algorithms for Complex Shapes with Certified Numerics and Topology Voronoi diagram of ellipses: cgal-based implementation
We present a C++ open-source implementation of an incremental algorithm for the computation of the Voronoi diagram of ellipses in the Euclidean plane. This is the first complete implementation, under the exact computation paradigm; it also computes the approximate diagram with any given precision. It is based on the cgal package for the Apollonius diagram. The ellipses are given in parametric r...
متن کاملVoroprot: an interactive tool for the analysis and visualization of complex geometric features of protein structure
UNLABELLED We present Voroprot, an interactive cross-platform software tool that provides a unique set of capabilities for exploring geometric features of protein structure. Voroprot allows the construction and visualization of the Apollonius diagram (also known as the additively weighted Voronoi diagram), the Apollonius graph, protein alpha shapes, interatomic contact surfaces, solvent accessi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 33 شماره
صفحات -
تاریخ انتشار 2006